Method and apparatus for channel amplitude estimation and interference vector construction

ABSTRACT

The present invention is directed to an efficient method and apparatus for channel determination and interference vector construction in accordance with spread spectrum systems. Channel determination is performed using a first series of fast Walsh transform steps. The results of the first set of fast Walsh transform steps corresponding to valid communication system channels are compared to a threshold value. Results derived from the first set of fast Walsh transform steps are then passed through a second set of fast Walsh transform steps with the number of steps performed for a set of results determined by the symbol length associated with the channels from which the amplitude information was derived. The interference vectors thus obtained for each valid symbol length may then be combined to form a composite interference vector. The fast Walsh transform steps and other steps may be performed using shared hardware components or software modules.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of U.S. Provisional Application No. 60/418,187, entitled “Method for Channel Amplitude Estimation and Interference Vector Construction,” filed Oct. 15, 2002, the entire disclosure of which is hereby incorporated by reference.

FIELD OF THE INVENTION

[0002] The present invention is directed to the determination of channel amplitude in a communication system. In addition, the present invention is directed to the construction of interference vectors for use in creating an interference canceled signal. More particularly, the present invention is directed to channel amplitude estimation and interference vector construction using complimentary methods and/or structures.

BACKGROUND OF THE INVENTION

[0003] Wireless communication systems should provide for a large number of secure (or private) communication channels within their allotted frequency space. In order to achieve these goals, spread spectrum systems have been developed. In a spread spectrum type system, spreading codes are used that allow multiple channels to occupy the same frequency range. In order to successfully demodulate a channel, the spreading code and covering code used in connection with the channel must be known. When a demodulation processor is tracking a particular single path, single paths associated with other transmitters appear to that processor as noise.

[0004] In order to provide for reliable communications, spread spectrum systems typically track multiple signal paths in connection with establishing and maintaining a communication channel between a pair of end points. The different signal paths may result from redundant signals that are provided by additional base stations and base station sectors, or from reflected or multipath versions of signals. In a typical receiver, a number (e.g., 4-6) demodulation processors or fingers are provided, and each of these fingers is assigned to track a different signal path. In order to obtain information regarding the different signal paths that are available to a receiver, a searcher demodulation processor or finger is provided. In a typical receiver, the searcher finger detects and identifies signals by pseudo-random number (PN) code offsets and signal strength. Because signal paths other than the signal paths being tracked appear as noise to a demodulation processor, the signal to noise ratio with respect to a tracked or desired signal path can be low, which can result in a communication channel with poor quality and reliability. In particular, signals from sources that are in close proximity to the receiver can drown out signals from sources that are farther away from the receiver. Accordingly, because of this “near-far” problem, signal diversity is limited. In addition to leaving communication channels more vulnerable to interruption, relatively weak signals that might otherwise be available to a receiver may lie beneath the noise floor created by other relatively strong signals.

[0005] The encoded channels broadcast by a base station generally do not interfere with one another due to the orthogonality of the covering Walsh codes or the quasi-orthogonality of the covering quasi-orthogonal functions (QOF). However, a spread spectrum communication system, such as a direct sequence, code division multiple access (DS-CDMA) system is still subject to two forms of multiple access interference on the forward link. Co-channel interference consists of multipath copies of signal paths that are delayed in time with respect to a signal path of interest. Such signals can cause interference because the orthogonality of the Walsh covering codes is lost whenever a time offset exists between two codes. Specifically, when aligned, Walsh codes form an orthogonal basis, but there may be high cross correlations when they are not aligned. Cross channel interference occurs when a combination of transmissions from more than one base station sector or base station are received at the RF front end simultaneously. Each base station sector is distinguished by a unique PN short code offset. However, the sequence has minimal, but non-zero cross-correlation properties. This manifests itself as cross-correlation interference between signals originating from different base station sectors. As a result, a signal transmitted from another base station that is received at a much greater power level is capable of masking the signal of interest due to the non-zero cross-correlation of the short code and the unaligned Walsh codes.

[0006] Methods for removing interfering signal paths from received signal streams have been developed. For example, interference cancellation is a feature incorporated into many spread spectrum receivers designed for CDMA systems, such as the cdma2000 and W-CDMA standards for wireless communications. In particular, interference cancellation receivers are a class of spread spectrum communication system receivers that have the capability to remove or reduce the interference from an interfering source or sources. Most methods of interference cancellation require the estimation of channels in the interfering signal source. Accordingly, the identity of valid channels within a signal path and the amplitudes of those channels must be estimated. Other methods, which utilize projection based methods for interference calculation require the construction of an interference vector to represent the direction of the interference from active channels within an interfering signal source, but not necessarily the amplitude of those channels.

[0007] Spread spectrum communication systems were initially developed using symbols of a single length. For example, IS-95 systems use a 64 chip symbol length. However, more recent communication standards, such as cdma2000, have introduced shorter length codes (supplemental channels) that coexist with longer codes. For example, to facilitate high-speed data transmissions, communication systems that allow symbols that are as short as four chips long for data transmission, while at the same time allowing channels utilizing symbols that are 64 chips long or more for voice communications have been developed. The use of symbols of different lengths within a single communication system has complicated the task of identifying active channels in a signal path. In addition, because the use of shorter length codes invalidates certain families of longer length codes, existing methods for identifying active channels can be inefficient when applied to systems supporting the use of multiple symbol lengths.

[0008] The fast Walsh transform is a known method for efficiently calculating the amplitudes of multiple channels within a signal path. In particular, the fast Walsh transform method can be used to calculate the amplitudes of channels that are covered using an orthogonal family of codes known as Walsh codes. However, conventional methods for applying the fast Walsh transform process have not been capable of efficiently estimating channels in connection with communication systems that support multiple symbol lengths. In addition, conventional methods have been incapable of efficiently constructing an interference vector for interference cancellation.

SUMMARY OF THE INVENTION

[0009] The present invention is directed to solving these and other problems and disadvantages of the prior art. According to an embodiment of the present invention, a fast Walsh transform is applied to amplitude information concerning an interfering signal path. In particular, the amplitude information is at a resolution corresponding to each chip of data received in connection with tracking an interfering or potentially interfering signal paths. The amplitude data is then processed using a fast Walsh transform. The data may be passed through one or more fast Walsh transform levels to identify active channels. In particular, after processing of the data at a Walsh level corresponding to a valid symbol length for data transmitted by the interfering signal path, the amplitude of each element in the set of data for that stage is compared to a threshold value. If the magnitude of an element is greater than the threshold value, that element is replaced with a zero before the data set is subjected to a next stage of processing using the fast Walsh transform. Accordingly, the present invention provides a method and apparatus by which the presence and amplitude of valid channels within a signal path produced in connection with a communication system supporting multiple valid symbol lengths can be determined.

[0010] In accordance with another embodiment of the present invention, the results of performing a fast Walsh transform at each Walsh level corresponding to a valid symbol length are applied in forming a vector for use in creating an interference canceled signal stream. Accordingly, in an embodiment of the present invention, the results of performing a fast Walsh transform at a level corresponding to a valid channel symbol length are compared to a threshold value. Individual elements of the results at that level having a magnitude that is less than the threshold are replaced by a zero, while the amplitudes of elements that exceed the threshold are left unaltered. The results of this comparison may be stored in a register. For each register containing threshold data for use in constructing an interference vector, fast Walsh transform processing is applied. In particular, each set of data is passed through a number of fast Walsh transform levels corresponding to the level from which the magnitude data was originally obtained, resulting in the creation of an interference vector. In accordance with another embodiment of the present invention, where multiple symbol lengths are supported, interference vectors formed using data from fast Walsh transform levels corresponding to valid symbol lengths are combined to form a composite interference vector. In accordance with an embodiment of the present invention, a composite interference vector is found by combining scaled interference vectors corresponding to each valid signal length. In accordance with a further embodiment of the present invention, the scaling is performed to normalize the energies within the individual interference vectors.

[0011] In accordance with another embodiment of the present invention, the fast Walsh transform processes used in connection with channel estimation and interference vector construction are implemented using shared hardware components. That is, the same components used in connection with estimating channel amplitudes can be used for constructing interference vectors.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012]FIG. 1 is a block diagram depicting components of a spread spectrum receiver in accordance with an embodiment of the present invention;

[0013]FIG. 2 is a block diagram depicting process steps and information flows in connection with components of a channel estimation and interference vector generation system in accordance with an embodiment of the present invention;

[0014]FIG. 3 is a block diagram illustrating aspects of the implementation of a fast Walsh transform in accordance with an embodiment of the present invention;

[0015]FIG. 4 is a block diagram illustrating aspects of the implementation of a threshold comparison function in accordance with an embodiment of the present invention;

[0016]FIG. 5 is a flowchart illustrating aspects of the operation of an embodiment of the present invention;

[0017]FIG. 6 is a flowchart illustrating additional aspects of the operation of an embodiment of the present invention;

[0018]FIG. 7 is a flowchart illustrating aspects of the construction of an interference vector in accordance with an embodiment of the present invention; and

[0019]FIG. 8 illustrates aspects of a process for creating a composite interference vector in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION

[0020] With reference now to FIG. 1, an interference cancellation enabled receiver 100 in accordance with an embodiment of the present invention is illustrated. As depicted in FIG. 1, signals are provided to a radio frequency (RF) front end 104 by an antenna 108. In a typical environment, a number of different signals, for example, signals produced by different base stations, different sectors of a base station, or multipath or reflected versions of the signals can be received at the radio frequency (RF) front end 104. As can be appreciated by one of skill in the art, signals from different base stations or different sectors of a base station are typically identified by an associated path number or pseudo-random number (PN), which identifies the base station or base station and sector according to the time offset of the signal path in the PN code space. Multipath versions of signals are identified by the path number of the line of sight version of the signal, but with an additional time offset to account for the longer path followed by the reflected signal. As can further be appreciated by one of skill in the art, signal paths from different sources are typically separated by a distance (e.g., multiple of 64 chips) sufficient to allow multipath versions of signal paths to be correctly associated with their source.

[0021] The RF front end 104 down samples the radio frequency signal and separates the signal into a complex base band signal or raw signal stream 112 with in phase (I) and quadrature (Q) components. It will be recognized by those skilled in the art that the processing depicted and described in connection with the present disclosure includes both the I and Q channels, even when only one connection or signal path is depicted.

[0022] The raw signal stream 112 collected by the receiver 100 and down converted from the RF front end 104 is provided to a searcher finger 116. The searcher finger functions to scan the signal stream 112 for individually identifiable signal paths and/or multipaths. In particular, the searcher finger 116 operates to determine the path number or pseudo-random number (PN) code offset associated with each identifiable signal path. As noted above, the PN code identifies the signal path as being associated with a particular base station or base station sector. In code division multiple access (CDMA) systems, the PN code sequence is referred to as the short code.

[0023] The searcher finger 116 reports the signal paths that have been identified to a controller 120. The controller 120 may use the information provided from the searcher finger 116 to determine which signal paths to acquire and track. In general, the number of signal paths that a receiver 100 can be directed to track is limited by the number of demodulation fingers 124 provided as part of the receiver 100. In assigning a demodulation finger 124 to acquire and track a signal path, the controller 120 may provide information regarding the PN code offset, any additional time offset and the observed signal strength for the assigned signal path. In FIG. 1, only two demodulation fingers 124 a and 124 b are shown. However, it should be appreciated that any number of additional demodulation fingers 124 may be provided.

[0024] As shown in FIG. 1, the baseline controller 120 may be in communication with a cancellation controller 128. As will be described herein, the cancellation controller 128 is capable of estimating the amplitudes of individual channels within a signal path. In addition, embodiments of the cancellation controller 128 are capable of forming interference vectors. In accordance with other embodiments of the present invention, the cancellation controller 128 can combine multiple interference vectors to form a composite interference vector.

[0025] The cancellation controller 128 includes a number of modules. In particular, when the cancellation controller 128 determines that a signal path should be canceled, the PN code corresponding to that signal path, and the I and Q data in which the signal path is present, are fed into the quadrature phase shift key (QPSK) despreading module 132. After despreading, the carrier phase is recovered in the carrier phase recovery module 136. Carrier phase recovery may be made using a variety of methods. For example, carrier phase recovery may be performed as described in U.S. Pat. No. ______, filed Oct. 15, 2003, entitled “System and Method for Adjusting Phase”, and U.S. Provisional Patent Application Serial No. 60/418,188, entitled “Carrier Phase Recovery Circuit,” filed Oct. 15, 2002, assigned to the assignee of the present invention, the entire disclosures of which are incorporated herein by reference. The PN stripped and phase stripped data stream obtained after carrier phase recovery is then provided to the channel estimation/interference vector generation module 140. The channel estimation/interference vector generation module 140 determines the amplitude of active channels in the signal paths to be cancelled, and produces an interference vector that may be provided to a cancellation operation module 144. The cancellation operation module 144 uses the interference vector provided by the channel estimation/interference vector generation module 140 to remove the identified interfering signal path from a signal stream or streams 148 provided to one or more demodulation fingers 124. A demodulation finger 124 receiving the interference canceled signal may then demodulate data transmitted by a channel of a desired signal path.

[0026] As illustrated in FIG. 1, the demodulation fingers 124 may each be provided with a PN generator 152. Furthermore, the PN code generated by a PN generator 152 may be advanced or delayed in response to a control signal 156 sent to the PN generator 152 by the cancellation controller 128. The ability to delay or advance the PN generators 152 associated with the demodulation fingers 124 is advantageous because it allows the demodulation fingers 124 to each track a provided feed signal stream, even if that feed signal stream has undergone delays, for example in processing in the cancellation controller 128 as part of the generation of an interference canceled signal stream. Alternatively or in addition, the cancellation controller may provide a demodulated signal to a delay buffer provided as part of the demodulation fingers 124 to control an amount of delay introduced by each demodulating finger 124 before a symbol obtained from a provided signal stream is released by the demodulation finger 124. By so controlling the delay within the demodulation fingers 124, demodulated signal streams 160 may be provided to a symbol combiner 164 that are synchronized with one another. Accordingly, a conventional symbol combiner 164 may be used. Alternatively, a symbol combiner 164 that is capable of synchronizing symbols obtained from the processing of provided signal streams 148 by demodulation fingers 124 may be used. As yet another alternative, the cancellation controller 128 may provide feed signal streams to demodulation fingers 124 after a fixed delay with respect to the raw signal stream 112 as it is received in the RF front end 104, so that a conventional symbol combiner 160 may be used. In general, any method may be used that provides synchronized data to the symbol combiner 164. As can be appreciated by one of skill in the art, the demodulation fingers and symbol combiner 164 may comprise a rake receiver.

[0027] With reference now to FIG. 2, aspects of a cancellation controller 128 and in particular of a channel estimation/interference vector generation module 140 in accordance with an embodiment of the present invention are illustrated. As shown in FIG. 2, the channel estimation/interference vector generation module 140 may be considered as comprising first 204 and second 208 stages. In particular, the first stage 204 performs channel estimation functions, while the second stage 208 performs interference vector construction. Furthermore, as will be appreciated from the description provided herein, in stage one 204, information related to the magnitude of chips received as part of a signal path are subjected to a number of fast Walsh transform steps 212 to determine the presence of valid channels within the signal path identified as interfering, and the amplitudes of those channels. The number of fast Walsh transform steps 212 used to process the received data is equal to log N, where N is the number of valid channels. For example, in connection with a 64 channel communication system, 6 steps are needed to completely determine which channels are present in a signal path. As a further example, a 128 channel communication system would require 7 steps. The information regarding the amplitudes of the channels obtained by stage one 204 is used by stage two 208 to form a composite interference vector 216 for use by the cancellation operation module 144 to cancel the interfering signal path from a signal stream provided to a demodulation finger 124.

[0028] Accordingly, as illustrated, stage one 204 includes a number of fast Walsh transform steps 212. In the exemplary embodiment illustrated in FIG. 2, the receiver 100 is for use in connection with a communication system that supports 64 traffic channels within each signal path. Accordingly, the channel estimation/interference vector generation module 140 includes 6 fast Walsh transforms steps 212 a-f. However, it should be appreciated that any number of fast Walsh transform steps 212 may be provided.

[0029] Initially, the despread carrier phase recovered received signal is passed through the first fast Walsh transform step 212 a. In the present example, the described fast Walsh transform steps are performed on a set of data comprising an amplitude or magnitude for each chip within a segment of data having a length equal to the longest valid symbol length. Accordingly, in the present example, each fast Walsh transform step 212 is performed on a set of data containing 64 different magnitudes.

[0030] As can be appreciated by one of skill in the art, the first fast Walsh transform step comprises 64 addition or subtraction operations. More specifically, the first fast Walsh transform step 212 a comprises adding the first element a₁ to the second element a₂ to obtain a new first element, subtracting the second element a₂ from the first element a₁ to obtain a new second element, adding the third element a₃ to the fourth element a₄, to obtain a new third element, subtracting the fourth element a₄ from the third element a₃ to obtain a new fourth element, and so on, until all 64 elements within the set have been processed and 64 new values calculated. In the present example, the communication system does not support symbols that are less than four chips long. Accordingly, the results of performing the first fast Walsh transform step or circuit 212 a are passed directly to the second fast Walsh transform step 212 b

[0031] As can also be appreciated by one of skill in the art, in the second fast Walsh transform step 212 b, there are also 64 additions or subtractions. The calculations included in the second fast Walsh transform step 212 b are performed on the 64 magnitudes or elements resulting from the first Walsh transform step 212 a. In particular, the first element a₁ is added to the third element a₃ to obtain a new first element, the third element a₃ is subtracted from the first element a₁ to obtain a new second element, the second element a₂ is added to the fourth element a₄ to obtain a new third element, the fourth element a₄ is subtracted from the second element a₂ to obtain a new fourth element, and so on, until each element within the set has been included in one addition, and one subtraction calculation as part of the second fast Walsh transform stage 212 b and a new value has been calculated for each included element.

[0032] In the present example, the communication system supports symbols having a length as short as four chips. The minimum length of a valid symbol used in connection with a communication system is known from the standards, and therefore is typically preconfigured for a given receiver 100. Alternatively, such information may be provided by a base station or other network component in communication with a receiver 100. Because in the present example symbols as short as four chips can be used by a channel, and because any such channels can be determined after two fast Walsh transform steps, the magnitudes obtained following the two fast Walsh transform steps are considered. In particular, each element within the set of calculated values or magnitudes is compared to a threshold value in a first comparator or comparison block 220 a. The threshold against which channel strengths are tested in connection with channel determination may be equal to or derived from a magnitude of a channel that is known to be present as part of the interfering signal paths. For example, the average magnitude of a received channel that, according to the applicable standards is always present in a signal path may be used to set the threshold value. The threshold may also be set to a preselected value or to a fixed value if a criteria for the magnitude for a channel that is present is developed.

[0033] Following the comparison, magnitudes within the set of values that are found to be equal to or greater than (or, alternatively, greater than) the threshold magnitude are stored in a first memory block 224 a. Zero values are entered or stored in the first memory block 224 a for those elements that are less than (or, alternatively, not greater than) the threshold magnitude. The values (i.e., channel amplitudes) stored in first memory block 224 a are related to an active channel or channels using symbols that are four chips long to transmit data. Furthermore, as described herein, the values stored in the memory blocks 224 provided as part of stage one 204 of the channel estimation/interference vector generation module 140 comprise an interference vector precursor, and will be used in stage two 208 to calculate the interference vector. The elements or channel amplitudes determined in the first comparison block 220 a to be lower than (or, alternatively, less than or equal to) the threshold are stored in memory block 228 as a channel estimate. Zero values are entered or stored in memory block 228 for those elements that are equal to or greater than (or, alternatively, greater than) the threshold magnitude. Accordingly, as will be appreciated from the present disclosure, the channel estimation/interference vector generation module 140 will be prevented from creating interference vectors for invalid, longer length channels. That is, an interference vector would not be created that includes or accounts for channels using four longer length symbols that are invalidated by the use of a shorter length (e.g., four chip) symbol.

[0034] The values comprising stored magnitudes or zero values following the first comparison step 220 a stored in memory 228 are then provided to the third fast Walsh transform step 212 c. As can be appreciated by one of skill in the art, as part of the third fast Walsh transform step 212 c, the first element a₁ is added to the fifth element a₅ to obtain a new first element, the fifth element a₅ is subtracted from the first element a₁ to obtain a new second element, the second element a₂ is added to the sixth element a₆ to obtain a new third element, the sixth element a₆ is subtracted from the second element a₂ to obtain a new fourth element, and so on, until each of the magnitudes within the set have been included in one addition and one subtraction operation and a new magnitude has been calculated for each element.

[0035] The results of the third fast Walsh transform step 212 c are then compared to the threshold at a second comparison step 220 b. Each magnitude within the results of the third fast Walsh transform that is greater than or equal to the threshold as stored in a second memory block 224 b. Zero values are stored in memory block 224 b for those elements (i.e., those magnitudes) having a magnitude that is not greater than or equal to the threshold. Element magnitudes that are less than the threshold are stored in the memory block 228, and zero values are stored in the memory block 228 for elements having a magnitude that is greater than the threshold. The value stored in the memory block 228 after the second comparison step 220 b may replace the element magnitudes or values stored in the memory block 228 following the previous or first comparison step 228.

[0036] The values comprising stored magnitudes or zero values following the second comparison step 220 b are then provided to the fourth fast Walsh transform step 212 d. As can be appreciated by one of skill in the art, as part of the fourth fast Walsh transform step 212 d, the first element a₁ is added to the ninth element a₉ to obtain a new first element, the ninth element a₉ is subtracted from the first element a₁ to obtain a new second element, the second element a₂ is added to the tenth element a₁₀ to obtain a new third element, the tenth element a₁₀ is subtracted from the second element a₂ to obtain a new fourth element, and so on, until each of the magnitudes within the set have been included in one addition and one subtraction operation and a new magnitude has been calculated for each element.

[0037] The results of the fourth fast Walsh transform step 212 d are then compared to the threshold at a third comparison step 220 c. Each magnitude that is greater than or equal to the threshold is stored in a third memory block 224 c. Zero values are stored in memory block 224 c for those elements having a magnitude that is not greater than or equal to the threshold. Element magnitudes that are less than the threshold are stored in the memory block 228, and zero values are stored in the memory block 228 for elements having a magnitude that is greater than the threshold. The values stored in the memory block 228 after the third comparison step 220 c may replace the element magnitudes or values stored in the memory block 228 following the second comparison step 220 b.

[0038] The values stored in the memory block 228 following the fourth fast Walsh transform step 212 d and the third comparison step 224 c are then provided to the fifth fast Walsh transform step 212 e for processing. As can be appreciated by one of skill in the art, the fifth fast Walsh transform step 212 e, comprises adding the first element a₁ to the seventeenth element a₁₇ to obtain a new first element, subtracting the seventeenth element a₁₇ from the first element a₁ to obtain a new second element, adding the second element a₂ to the eighteenth element a₁₈ to obtain a new third element, subtracting the eighteenth element a₁₈ from the second element a₂ to obtain a new fourth element, and so on, until each of the elements has been included in one addition and one subtraction operation, and a new magnitude has been calculated for each of the elements.

[0039] The results of performing the fifth fast Walsh transform step 212 e are then compared to the threshold value in a fourth comparison step 220 d. Elements with amplitudes that are equal to or greater than the threshold are stored in memory block 224 d, while amplitudes for elements that are lower than the threshold are changed to zero in memory block 224 d. The values of element amplitudes that are less than the threshold are stored in memory block 228, while elements having amplitudes that are equal to or exceed the threshold are stored in the memory block 228 with a value of zero.

[0040] The values stored in memory block 228 following the fifth fast Walsh transform step 212 e and the fourth comparison step 220 d are then provided to the sixth fast Walsh transform step 212 f for processing. As can be appreciated by one of skill in the art, the sixth fast Walsh transform step 212 f comprises adding the first element a₁ to the thirty-third element a₃₃ to obtain a new first element, subtracting the thirty-third element a₃₃ from the first element a₁ to obtain a new second element, adding the second element a₂ to the thirty-fourth element a₃₄ to obtain a new third element, subtracting the thirty-forth element a₃₄ from the second element a₂ to obtain a new fourth element, and so on, until each of the elements has been included in one addition and one subtraction operation, and a new magnitude has been calculated for each of the elements.

[0041] The results of performing the sixth fast Walsh transform step 212 f are then compared to the threshold in a fifth comparison step 220 e. In accordance with the embodiment illustrated in FIG. 2, elements having a magnitude that is greater than or equal to the threshold are stored as a set in memory block 228 in which elements that have magnitudes less than the threshold are changed to zero. In particular, because in the present example the sixth fast Walsh transform step 212 f is the last to be performed (i.e., the longest valid symbol length for this example is 64), the memory block 228 that was used to store values for use in connection with a next step of fast Walsh transform processing can instead be used to store data for use in constructing an interference vector.

[0042] Following the completion of the channel determination steps included as part of stage one 204, amplitude information collected in connection with valid channels can be selectively provided to stage two 208 for construction of a composite interference vector 216. In particular, a multiplexer 230 may provide channel amplitude data from a selected one of the memory blocks 224, 228. The amplitude data is then processed using the number of fast Walsh transform steps corresponding to the level from which the amplitude information was obtained.

[0043] Accordingly, the amplitude information with respect to the magnitudes stored in the first memory block 224 a are provided to first fast Walsh transform step or circuit 212 a′ and second fast Walsh transform step 212 b′. The first 212 a′ and second 212 b′ fast Walsh transform steps may be performed using the same componentry as was used in connection with performing the first fast Walsh transform step 212 a and second fast Walsh transform step 212 b as part of the stage one 204 processing. Because the data stored in block 224 a is related to channels using symbols of length four, that data is only processed by fast Walsh transform steps one 212 a′ and two 212 b′. The results obtained after the second fast Walsh transform step 212 b′ has been performed on the data from memory block 224 a is stored as interference vector one (IV1) 228 a, for example in first memory block 224 a.

[0044] The multiplexer 230 may next be operated to provide the magnitudes stored in the second memory 224 b to the second stage 208. The set of magnitudes or values stored in the second memory 224 b were passed through three steps or levels of fast Walsh processing 212. Accordingly, in stage two 208 these values will be passed through three fast Walsh transform steps: fast Walsh transform step one 212 a′, fast Walsh transform step two 212 b′, and fast Walsh transform step three 212 c′. The results obtained after performing the third step of fast Walsh processing 212 c′ may then be stored as interference vector two (IV2) 232 b, for example in the second memory block 224 b.

[0045] The data stored in memory block 224 c is processed by passing that data through four fast Walsh transform steps 212 a′-d′. The results of that processing are stored as interference vector 3 (IV3) 232 c, for example in memory 224 c.

[0046] Data stored in memory block 224 d is processed by passing that data through five fast Walsh transform sets 212 a′-e′. The results of that processing are stored as interference vector 4 (IV4) 232 d, for example in memory block 224 d.

[0047] The data that was stored in memory block 228 following the sixth step of fast Walsh transform processing 212 f and the fifth comparison step 220 e may then be provided to the second stage 208 by the multiplexer 230. The data is passed through six fast Walsh transform steps 212 a′-f′, and stored, for example in memory 228 as interference vector 5 (IV5) 232 e.

[0048] The individual interference vectors 232 a-e may then be added in summation block 236 to form the composite interference vector 216. In accordance with the embodiment of the present invention, each of the interference vectors 232 is scaled. In particular, each interference vector 232 is multiplied by a value such that the amount of energy represented by the set of magnitudes included in each of the interference vectors 232 is normalized. Accordingly, the first interference vector 232 a may be multiplied by sixteen to obtain a first scaled interference vector, the second interference vector 232 b is multiplied by eight to obtain a second scaled interference vector, the third interference vector 232 c is multiplied by four to obtain a third scaled interference vector, the fourth interference vector 232 d is multiplied by two to obtain a fourth scaled interference vector, and the fifth interference vector 232 e is multiplied by one obtain a fifth scaled interference vector. These scaled interference vectors are then added together to obtain the composite interference vector 216.

[0049] As can be appreciated from the description provided herein, various processes are repeated in stages one 204 and two 208. Such processes may use or share the same hardware components and/or processing modules. Furthermore, the various stages can share hardware elements and/or processing modules. In particular, the hardware and/or processing modules used in connection with implementing the fast Walsh transform steps 212 as part of stage one 204 processing can also be used in connection with the fast Walsh transform steps 212′ completed in connection with stage two 208 processing. Furthermore, as described above, various memory blocks and registers 224, 228 can be used in connection with both stage one 204 and stage two 208.

[0050] With reference now to FIG. 3, aspects of the implementation of a fast Walsh transform in accordance with an embodiment of the present invention are illustrated. In particular, FIG. 3 depicts a hardware structure or circuitry that may be used to implement a fast Walsh transform step 212, 212′. In general, the fast Walsh transform circuitry 300 includes a first multiplexer 304 and a second multiplexer 308. Each of the multiplexers 304, 308 receives as input data 312 a set of values for processing. Accordingly, where the fast Walsh transform circuit 300 is performing a first fast Walsh transform stage 212 a, 212 a′, the set of values provided as an input 312 to the multiplexers 304, 308 comprises despread, but otherwise raw data, representing received chip amplitudes. Where the fast Walsh transform circuitry 300 implements a second or later fast Walsh transform step 212, 212′, the inputs 312 comprise elements calculated during a previous fast Walsh transform step 212, 212′. Furthermore, the elements provided as inputs 312 may be modified as described herein. For example, data provided as inputs 312 to a fast Walsh transform circuit 300 implementing a fast Walsh transform step 212 included in stage one 204 may comprise actual element magnitudes and zero values for element magnitudes that were determined to be greater than or equal to the threshold value that have been changed to a value of zero and stored in memory 228. Furthermore, it should be appreciated that where a number of fast Walsh transform steps 212 have been performed on the input data such that the Walsh level corresponds to a valid minimum symbol length, the input values may comprise channel amplitudes. As a further example, data provided as inputs 312 to a fast Walsh transform circuit 300 implementing a fast Walsh transform step 212′ included in stage 2 208 may comprise actual element magnitudes and zero values for element magnitudes that were determined to be less than the threshold value that were stored in a memory block (e.g., one of the memory blocks 224 a-d or memory 228 for data resulting from a first fast Walsh transform step 212 in stage one 204).

[0051] A single element from each of the multiplexers 304, 308 is provided at a corresponding output 316 or 320 in response to a select signal 324. In general, the select signal 324 is generated by the channel estimation/interference vector generation module 140, or by some other modular aspect of the cancellation controller 128, to provide the proper pair of elements at the outputs 316, 320. The outputs 316, 320 of the multiplexers 304, 308 are provided to an adder—subtractor 324. The adder—subtractor comprises an adder that provides a first output 328 comprising a value resulting from the addition of the value output by the first multiplexer 304 on output line 316, and the value output by the second multiplexer 308 on input line 320. The adder—subtractor 324 additionally includes a subtractor that provides as an output the subtraction of the value provided by the second multiplexer 308 from the value provided by the first multiplexer 308 on second output line 332.

[0052] In accordance with an embodiment for use in connection with a communication system having a maximum symbol length of 64 chips, four fast Walsh transform circuits 300 may be used to obtain a complete set of 64 transform values. The results of the addition and subtraction operations available at the outputs 328, 332 may then be further processed by additional fast Walsh transform steps, and/or compared to a threshold as described elsewhere herein.

[0053] With reference now to FIG. 4, components of a comparison circuit 400 are illustrated. In general, the comparison circuit 400 may be used in connection with the comparison steps 220. The comparison circuit 400 may include a comparator 404 having as a first input a threshold 408 and an element value or channel amplitude 412. A selected element value or channel amplitude may be provided from a multiplexer 416. The comparator 404 has a high output 420 and a low output 424. If the element value under consideration is less than the threshold, for purposes of providing transform element values for a next fast Walsh transform step 212, the high output 420 is set to zero and the low output is set to the channel amplitude. Furthermore, for purposes of storing channel amplitudes in memory 224 for determination of an interference vector 228, if the channel amplitude is greater than or equal to the threshold, the high output 420 is set to the channel amplitude and the low output 424 is set to zero.

[0054] With reference now to FIG. 5, aspects of the operation of an embodiment of the present invention are illustrated. Initially, at step 500, a signal path identified as an interfering or potentially interfering signal path is acquired and tracked. At step 504, channel estimation is performed, during which the amplitude of channels that may be present in the track signal path are determined. As can be appreciated by one of skill in the art, the signal path comprises a linear combination of channels that may have been transmitted at multiple rates. For example, a CDMA 2000 signal may contain channels having a symbol duration varying in length from four chips to 128 chips, and the identity and length of the symbols in the channels present would depend on what was transmitted by the transmitter at the base station or mobile station during the time of interest.

[0055] Following channel estimation, channel determination and threshold comparison is performed (step 508). Channel determination and threshold comparison 508 includes determining whether a particular channel is actually present in the signal paths. As described herein, channel determination includes a step of comparing a received magnitude for a channel with a threshold value. Various algorithms may be used for determining the threshold. A channel that is known to be always present in a signal path, as provided by the applicable standards, is usually chosen for determining the threshold. For example, in a CDMA 2000 receiver, the average magnitude of the synchronization channel (averaged over an arbitrary number of symbols) may be used to determine the threshold.

[0056] According to the present invention, following channel determination, interference vector construction is performed (step 512). Furthermore, the present invention provides for the construction of a composite interference vector. The composite interference vector may be constructed as described in U.S. Provisional Patent Application No. 60/331,480, entitled “Construction of an Interference Matrix for a Coded Signal Processing Engine,” filed Nov. 16, 2001, the entire disclosure of which is incorporated herein by reference.

[0057] With reference now to FIG. 6, additional aspects of the operation of an embodiment of the present invention are illustrated. Initially, at step 600, input data is read into Walsh step one 212 a (step 604). In general, the input data read into Walsh step one comprises a set of magnitudes. Furthermore, the step of magnitudes contains a number of elements equal to the number of chips in a longest valid symbol for the communication system in connection with which the present invention is being deployed. A Walsh update step is then performed on the input data (step 608). That is, a first fast Walsh transform step is performed. At step 612, a determination is made as to whether the Walsh level of the preceding Walsh update step includes valid channel data. For example, because log N fast Walsh transform steps must be performed in order to determine the channels that are present in a signal path having a symbol length equal to N chips, not all Walsh levels will contain valid channel data. Furthermore, because communication systems may define valid symbol lengths that are separated by one or more Walsh levels, Walsh levels for symbol lengths greater than a minimum valid symbol length may not contain valid channel data. For example, a communication system may define symbols of chip length 4 and 64 as valid, but intermediate symbol lengths (e.g., symbol lengths 8, 16 and 32) as invalid. If it is determined that the current Walsh level does not have valid channel data, the Walsh step is incremented (step 616) and the process returns to step 608.

[0058] If the Walsh level under consideration does have valid channel data, a determination is next made as to whether the magnitude of any valid channel (i.e., the magnitudes of any of the elements in the set under consideration) is greater than a threshold value (step 620). If any valid channel is determined to have a magnitude greater than the threshold, those channel magnitudes or amplitudes are stored (step 624). After storing channel amplitudes greater than the threshold (step 624), or after determining that no valid channels are greater than the threshold, a determination is made as to whether any valid channels have a magnitude that is less than the threshold (step 628). The magnitude of any valid channels that is less than the threshold is stored (step 632). After storing the amplitudes of any channels that are less than the threshold, or after determining that there are no valid channels with a magnitude that is less than the threshold, a determination is made as to whether there are any more Walsh steps to be performed (636). In general, the total number of Walsh steps to be performed is determined by the maximum valid symbol length used in connection with the applicable communication system. For example, for a communication system in which a maximum valid symbol length is 64 chips, 6 fast Walsh transform steps must be performed to complete channel determination. Accordingly, if Walsh steps remain to be performed, the Walsh step is incremented (step 640). The channel amplitudes that are less than the threshold are then read into the next Walsh step (step 644) and the process returns to step 608. As can be appreciated from the description provided herein, the magnitude of channels that were determined to exceed the threshold may be set to zero at step 644 in connection with the next fast Walsh transform step. If no more Walsh transform steps remain to be performed, the system proceeds to interference vector construction (step 640) (see FIG. 7).

[0059] With reference now to FIG. 7, steps taken in connection with the generation of interference vectors in accordance with an embodiment of the present invention are illustrated. Initially, at step 700, a first set of amplitudes stored for interference vector construction are obtained. For example, the set of amplitudes stored in the first memory 224 a are obtained. As described elsewhere herein, the amplitudes stored in the first memory 224 a may include actual amplitude values or those amplitudes found to be equal to or greater than a threshold, and a zero value for those amplitudes that were earlier found to be less than the threshold. At step 704, a count value j is set equal to the number of Walsh steps corresponding to the Walsh level of the channels under consideration. For example, where the values stored in the first memory 224 a have been processed by two fast Walsh transform steps 212 a and 212 b, j is set equal to two. Accordingly, j=Log n, where n is the symbol length for the stored values (i.e., the channel amplitudes). A first Walsh transform step is then performed on the channel amplitudes (step 708). The counter j is then decremented (step 712), and a determination is made as to whether j is equal to zero (step 716). If j is not equal to zero, a next Walsh step is performed on the data obtained as a result of performing the previous Walsh step (step 720). The process then returns to step 712.

[0060] If at step 716 it is determined that j is equal to zero, the results of the Walsh step or steps that were performed on the channel amplitudes under consideration are stored (step 724). For example, the results may be stored in a memory block as an interference vector 232. At step 728, a determination is made as to whether additional sets of channel amplitudes remain to be processed. If remaining sets of channel amplitudes remain to be processed, the next set of amplitudes stored for interference vector construction is obtained (step 732) and the process returns to step 704. If no additional sets of channel amplitudes remain to be processed, the process ends (step 736).

[0061] With reference now to FIG. 8, a process for constructing a composite interference vector 216 in accordance with an embodiment of the present invention is illustrated. Initially, a first set of channel amplitudes comprising a first interference vector 232 is obtained (step 800). At step 804, a counter k is set equal to a number of symbols included in any valid channels that the corresponding Walsh level for the channel amplitudes under consideration. For example, where the channel amplitudes under consideration correspond to channels having a minimum symbol length of four chips, k is set equal to four. As another example, where the channel amplitudes under consideration correspond to channels having a symbol length of 64 chips, k is set equal to 64. At step 808, the maximum valid symbol length is divided by k to obtain a coefficient for the interference vector under consideration.

[0062] At step 812, a determination is made as to whether there are additional interference vectors for which a coefficient remains to be calculated. If there are additional interference vectors, the next interference vector is obtained (step 816) and the process returns to step 804. If a coefficient has been calculated for all of the interference vectors, each interference vector is multiplied by the corresponding coefficient, and the resulting products are added to obtain a composite interference vector (step 820). The composite interference vector may then be applied to a signal stream, to create an interference cancel signal stream.

[0063] As can be appreciated by one of skill in the art, the various comparison steps generally result in a selected one of two possible events occurring. At various points in the description, a first action is described as being taken if a value under consideration is equal to or greater than a threshold value, and a second action is taken if the value under consideration is less than the threshold value. However, as a matter of design choice, the first event could be taken if the value under consideration is found to be greater than the threshold, and the second event could be taken if the value under consideration is found to be less than or equal to the threshold. That is, either a first or a second result is obtained from the comparison, which determines an action or event to be taken with respect to the element, if any.

[0064] Although the description provided herein has discussed exemplary communication systems having a maximum symbol length of 64 chips and a minimum symbol length of 4 chips, it should be appreciated that the present invention is not limited to use with such systems. In particular, the present invention may be applied to any spread spectrum communication system for which channel estimation is desired. For example, a communication system that supported symbol lengths of up to 128 chips could be accommodated by an additional fast Walsh transform step and an additional memory register. Furthermore, the present invention may be applied to any communication system for which the generation of interference vectors and/or a composite interference vector for interference cancellation purposes is desired.

[0065] As can be appreciated by one of skill in the art, aspects of the present invention may be implemented in various forms. For instance, the present invention may be implemented by hard or soft programming code running on a suitable processor having access to memory. Furthermore, the present invention may be implemented as an application specific integrated circuit (ASIC), or a field programmable gate array (FPGA). Furthermore, aspects of the present invention may be implemented using hard coded or dedicated logic circuits. For example, as described herein, multiplexers, adders, subtractors, comparators, memory and/or memory registers may be implemented in accordance with the present invention using discrete and/or integrated circuit components.

[0066] In addition, the present invention is not limited to voice communication systems. For example, embodiments of the present invention may be applied to any multiple channel system, including radio locating systems, such as the global positioning system (GPS), multi-media communications, and data transmission systems.

[0067] The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, the description is not intended to limit the invention to the form disclosed herein. Consequently, variations and modifications commensurate with the above teachings, within the skill and knowledge of the relevant art, are within the scope of the present invention. The embodiments described hereinabove are further intended to explain the best mode presently known of practicing the invention and to enable others skilled in the art to utilize the invention in such or in other embodiments and with various modifications required by their particular application or use of the invention. It is intended that the appended claims be construed to include the alternative embodiments to the extent permitted by the prior art. 

What is claimed is:
 1. A computational component for performing a method, the method comprising: performing at least a first fast Walsh transform on a first set of magnitudes, wherein said set of magnitudes contains a number of magnitudes that is equal to a number of chips in a longest valid symbol; storing a result of said performing at least a first fast Walsh transform in a first register; comparing each magnitude comprising said result of performing said at least a first fast Walsh transform to a threshold value; and replacing each magnitude of said stored result of performing said first fast Walsh transform that is greater than said threshold value with a zero to obtain a first modified result.
 2. The method of claim 1, wherein said first modified result is stored in said first register.
 3. The method of claim 1, further comprising: performing at least a second fast Walsh transform on said first modified result; storing a result of performing said at least a second fast Walsh transform in said first register; comparing each magnitude comprising said result of performing said second fast Walsh transform to said threshold value; and replacing each magnitude of said stored result of performing said at least a second fast Walsh transform that is greater than said threshold value with a zero to obtain a second modified result.
 4. The method of claim 3, wherein said second modified result is stored in said first register.
 5. The method of claim 1, further comprising: performing an (n-1)^(th) fast Walsh transform on a previously calculated modified result; storing a result of performing said (n-1)^(th) fast Walsh transform in a register; comparing each magnitude comprising said result of performing said (n-1)^(th) fast Walsh transform to said threshold value; replacing each magnitude of said stored result of performing said (n-1)^(th) fast Walsh transform that is greater than said threshold value with a zero to obtain an (n-1)^(th) modified result; performing an n^(th) fast Walsh transform on said (n-1)^(th) modified result; storing a result of performing said n^(th) fast Walsh transform in a register; comparing each magnitude comprising said result of performing said n^(th) fast Walsh transform to said threshold value; and replacing each magnitude of said stored result of performing said n^(th) fast Walsh transform that is greater than said threshold value with a zero to obtain an n^(th) modified result.
 6. The method of claim 5, wherein said results of performing said (n-1)^(th) and said n^(th) fast Walsh transforms are stored in said first register.
 7. The method of claim 6, wherein said result of performing said (n-1)^(th) fast Walsh transform are not stored in said first register simultaneously with said result of performing said n^(th) fast Walsh transform.
 8. The method of claim 5, wherein said register in which each of said (n-1)^(th) modified result and said n^(th) modified result is stored in comprises said first register.
 9. The method of claim 5, wherein said previously calculated modified result comprises said first modified result.
 10. The method of claim 5, further comprising: storing each magnitude comprising said result of performing said n^(th) fast Walsh transform having a magnitude that is not less than said threshold value in a second register; and storing a zero for magnitudes comprising said result of performing said n^(th) fast Walsh transform having a magnitude that is less than said threshold value in said second register, wherein said second register comprises a number of magnitudes that is equal to said number of chips in a longest valid symbol.
 11. The method of claim 10, wherein said storing a zero comprises replacing magnitudes stored in said second register having a magnitude that is not greater than said threshold value with a zero.
 12. The method of claim 10, wherein said n^(th) fast Walsh transform corresponds to a Walsh code set for symbols of a valid length.
 13. The method of claim 10, further comprising: storing said magnitude comprising said result of performing said (n-1)^(th) fast Walsh transform having a magnitude that is greater than said threshold value in a third register; and storing a zero for magnitudes comprising said result of performing said (n-1)^(th) fast Walsh transform having a magnitude that is not greater than said threshold value in said third register, wherein said third register comprises a number of magnitudes that is equal to said number of chips in a longest valid symbol.
 14. The method of claim 13, wherein said (n-1)^(th) fast Walsh transform corresponds to a Walsh code set for symbols of at least a minimum valid length.
 15. The method of claim 10, wherein said second register comprises a number of values equal to said number of chips in a longest valid symbol.
 16. The method of claim 13, further comprising: adding said value in said second register to a product equal to said value in said third register multiplied by 2 to obtain a composite interference vector.
 17. The method of claim 16, wherein said n^(th) fast Walsh transform corresponds to a Walsh code set for symbols of a maximum valid length.
 18. The method of claim 16, further comprising: applying said composite interference vector to a received signal stream to create an interference canceled signal stream.
 19. The method of claim 1, wherein said threshold value is derived from a magnitude of a selected received channel within a signal stream from which said first set of magnitudes are obtained.
 20. The method of claim 1, wherein said threshold value comprises a value derived from a magnitude of a sync channel.
 21. The method of claim 1, wherein said threshold value is equal to said magnitude of a sync channel.
 22. The method of claim 1, wherein said threshold value is a preselected value.
 23. The method of claim 1, wherein n is a number of fast Walsh transforms performed and is equal to log N, where N is the number of valid traffic channels.
 24. The method of claim 1, wherein said computational component comprises a computer readable storage medium containing instructions for performing the method.
 25. The method of claim 1, wherein said computational component comprises a logic circuit.
 26. A method for calculating interference calculation values, comprising: receiving a signal stream comprising a plurality of channels; despreading said signal stream by applying a despreading code; obtaining a first number of chip values from said despread signal stream, wherein said first number is equal to a number of chips included in a longest valid symbol; performing a fast Walsh transform on said first number of chip values to obtain a first set of transformed values, wherein said first result includes a first number of elements equal to said first number of chip values; comparing a value of each of said first number of elements of said first set of transformed values to a threshold; and creating a first modified set of values, wherein for each element of said first set of transformed values: in response to a first result of said comparison, a value of said element is changed to a zero; in response to a second result of said comparison, a value of said element is not changed to a zero.
 27. The method of claim 26, wherein said not replacing a value of said element with a zero comprises leaving said value of said element intact.
 28. The method of claim 26, further comprising: performing a fast Walsh transform on a previously created modified set of values to obtain an (n-1)^(th) set of transformed values, wherein said (n-1)^(th) set of transformed values includes said first number of elements; comparing a value of each of said first number of elements of said (n-1)^(th) set of transformed values to a threshold; creating an (n-1)^(th) modified set of values, wherein for each element of said (n-1)^(th) set of transformed values: in response to a first result of said comparison, a value of said element is changed to a zero; and in response to a second result of said comparison, a value of said element is not changed to a zero.
 29. The method of claim 28, wherein said previously created modified set of values comprises said first result.
 30. The method of claim 28, further comprising: performing a fast Walsh transform on said (n-1)^(th) modified set of values to obtain an n^(th) set of transformed values, wherein said n^(th) set of transformed values includes said first number of elements; comparing a value of each of said first number of elements of said n^(th) set of transformed values to a threshold; creating an n^(th) modified set of values, wherein for each element of said n^(th) set of transformed values: in response to a first result of said comparison, a value of said element is changed to a zero; and in response to a second result of said comparison, a value of said element is not changed to a zero.
 31. The method of claim 30, further comprising: creating a first composite interference vector component, wherein a value of each element of said n^(th) modified set of values is compared to a threshold, and wherein for each element of said n^(th) modified set of values: in response to a first result of said comparison, not changing a value of said element to a zero, and in response to a second result of said comparison, changing a value of said element to a zero.
 32. The method of claim 31, further comprising: creating a second composite interference vector component, wherein a value of each element of said (n-1)^(th) modified set of values is compared to a threshold, and wherein for each element of said (n-1)^(th) modified set of values: in response to a first result of said comparison, not changing a value of said element to a zero, and in response to a second result of said comparison, changing a value of said element to a zero.
 33. The method of claim 32, further comprising: combining said first and second composite interference vector components to one another to create a composite interference vector.
 34. The method of claim 32, further comprising: scaling said second composite interference vector component to obtain a scaled second composite interference vector component; and adding said first composite interference vector component to said scaled second composite interference vector component to obtain a composite interference vector.
 35. The method of claim 34, further comprising: projecting said composite interference vector onto a received signal stream to obtain an interference cancelled signal.
 36. The method of claim 26, wherein said changing a value of an element comprises replacing said value in a register.
 37. An apparatus for determining communication channel values, comprising: means for receiving a signal path; means for performing at least a first fast Walsh transform on a selected set of element amplitudes that is one of received as part of said signal path or received as part of said signal path and modified, wherein a first set of modified element amplitudes is obtained; means for comparing said first set of modified element amplitudes to a threshold; and first means for storing a channel estimate, wherein said channel estimate includes an element amplitude for an element having an amplitude that does not exceed said threshold and a zero for an element having an amplitude that exceeds said threshold.
 38. The apparatus of claim 37, wherein said selected set of element amplitudes is modified by providing said selected set of elements to means for performing a fast Walsh transform prior to providing said resulting modified element amplitudes to said means for performing at least a first fast Walsh transform.
 39. The apparatus of claim 37, further comprising: means for performing at least a first fast Walsh transform on said channel estimate, wherein a second set of modified element amplitudes is obtained.
 40. The apparatus of claim 39, further comprising: means for comparing said second set of modified element amplitudes to a threshold.
 41. The apparatus of claim 37, further comprising: means for storing an interference vector precursor, wherein said interference vector precursor includes an element amplitude for an element having an amplitude that exceeds said threshold and a zero for an element having an amplitude that does not exceed said threshold.
 42. The apparatus of claim 41, further comprising: means for performing at least a first fast Walsh transform on said interference vector precursor to obtain an interference vector.
 43. The apparatus of claim 42, further comprising: means for storing said interference vector.
 44. The apparatus of claim 42, further comprising: means for scaling an interference vector.
 45. The apparatus of claim 44, further comprising means for combining a plurality of interference vectors to form a composite interference vector.
 46. A receiver device, comprising: a fast Walsh transform module operable to perform a selected fast Walsh transform stage on a set of values; a comparator operable to compare each value output from said fast Walsh transform module to a threshold; a first memory register operable to store element values output from said comparator as having a value less than said threshold; and a second memory register operable to store element values output from said comparator as having a value not less than said threshold.
 47. The device of claim 46, wherein said comparator is additionally operable to output a zero for storing in said first memory register in place of element values having a value greater than said threshold.
 48. The device of claim 46, wherein said comparator is additionally operable to output a zero for storing in said second memory register in place of element values having a value less than said threshold.
 49. The device of claim 46, further comprising: a multiplexer operable to provide said element values stored in said second memory to said fast Walsh transform module, said fast Walsh transform module additionally being operable to perform at least a first fast Walsh transform on said stored element values to obtain an interference vector.
 50. The device of claim 49, further comprising: a scalar operable to multiply said interference vector by a selected value.
 51. The device of claim 50, further comprising a summer operable to add a plurality of scaled interference vectors to obtain a composite interference vector. 